A Universal, Analog, In-Memory Computing Primitive for Linear Algebra Using Memristors

نویسندگان

چکیده

The increasing demand for data-intensive computing applications, such as artificial intelligence (AI) and more specifically machine learning (ML), raises the need novel hardware architectures capable of massive parallelism in performing core algebraic operations. Among new paradigms, in-memory (IMC) with analogue devices is attracting significant interest its large-scale integration potential, together unrivaled speed energy performance. Here, we present a fully-analogue, universal primitive executing linear algebra operations regression, generalized least-square minimization system solution without preconditioning. We study impact main circuit parameters on accuracy bandwidth analytical closed-form expressions SPICE simulations. Scaling challenges due to parasitic resistance/capacitance their key are discussed. Finally, comparison existing solvers belonging same IMC framework made assess advantages disadvantages proposed circuit.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively Parallel Analog Computing: Ariadne's Thread Was Made of Memristors

This paper explores memristive grids where emergent computation arises through collective device interactions. Computing efficiency of the grids is studied in several scenarios and new composite memristive structures are utilized in shortest path and maze-solving computations. The dependence of the computing medium behavior on the symmetry of both the underlying geometry and the employed device...

متن کامل

Blocking Linear Algebra Codes for Memory Hierarchies

Because computation speed and memory size are both increasing, the latency of memory, in basic machine cycles, is also increasing. As a result, recent compiler research has focused on reducing the e ective latency by restructuring programs to take more advantage of high-speed intermediate memory (or cache, as it is usually called). The problem is that many real-world programs are non-trivial to...

متن کامل

A Scalable Linear Algebra Library for Distributed Memory Concurrent Computers

pack: A portable linear algebra library for high-performance computers. [4] C. C. Ashcraft. The distributed solution of linear systems using the torus wrap data mapping. Prospectus for the development of a linear algebra library for high performance computers. [14] J.J. Dongarra and R.A. van de Geijn. Reduction to condensed form for the eigenvalue problem on distributed memory architectures. LA...

متن کامل

A bi-level linear programming problem for computing the nadir point in MOLP

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

متن کامل

Universal Algebra for Logics

These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic in Montreux. They cannot be recommended for self studies because, although all definitions and main ideas are included, there are no proofs and examples. I’m going to provide some of them during my lectures, leaving easy ones as exercises. In the first part we discuss some of the most important n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems I-regular Papers

سال: 2021

ISSN: ['1549-8328', '1558-0806']

DOI: https://doi.org/10.1109/tcsi.2021.3122278